Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
نویسندگان
چکیده
We use logic-based Benders decomposition to minimize tardiness in single-facility scheduling problems with many jobs and long time horizons. Release dates and due dates are given. A mixed integer linear programming (MILP) based master problem allocates jobs to segments of the time horizon, and a constraint programming (CP) based subproblem schedules the jobs in each segment.
منابع مشابه
Single-facility scheduling by logic-based Benders decomposition
Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either method alone. We find that a similar technique can be beneficial for solving pure scheduling problems as the problem size scales up. We solve single-facility non-preemptive scheduling problems with time windows and long time horizon...
متن کاملMixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
A recent paper by Heinz and Beck (CPAIOR 2012) found that mixed integer software has become competitive with or superior to logic-based Benders decomposition for the solution of facility assignment and scheduling problems. Their implementation of Benders differs, however, from that described in the literature they cite and therefore results in much slower performance than previously reported. W...
متن کاملDeterministic and Stochastic Models for Practical Scheduling Problems
This dissertation analyzes three scheduling problems motivated by real life situations. In many manufacturing and service industries, scheduling is an important decision-making process. Unfortunately, scheduling problems are often computationally challenging to solve, and even modeling a scheduling problem can be difficult. Chapter 2 considers single-facility non-preemptive scheduling problems ...
متن کاملPlanning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve pro...
متن کاملBenders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty
Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...
متن کامل